Outraged, yet moderate and impartial

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Infinite Cyclic Impartial Games

We define the family of locally path-bounded digraphs, which is a class of infinite digraphs, and show that on this class it is relatively easy to compute an optimal strategy (winning or nonlosing); and realize a win, when possible, in a finite number of moves. This is done by proving that the Generalized Sprague-Grundy function exists uniquely and has finite values on this class.

متن کامل

Symmetry and impartial lotteries

A prize is to be randomly assigned to some agent, so each agent designates one of his peers on a ballot. The ballots determine the lottery which selects the winner, and impartiality requires that no agent’s report impacts his own chance of winning. The primary results are (1) a characterization of all impartial rules which treat agents symmetrically as voters and (2) a characterization of all i...

متن کامل

Impartial Peer Review

Motivated by a radically new peer review system that the National Science Foundation recently experimented with, we study peer review systems in which proposals are reviewed by PIs who have submitted proposals themselves. An (m, k)-selection mechanism asks each PI to reviewm proposals, and uses these reviews to select (at most) k proposals. We are interested in impartial mechanisms, which guara...

متن کامل

Three-player impartial games

Past efforts to classify impartial three-player combinatorial games (the theories of Li [3] and Straffin [4]) have made various restrictive assumptions about the rationality of one’s opponents and the formation and behavior of coalitions. One may instead adopt an agnostic attitude towards such issues, and seek only to understand in what circumstances one player has a winning strategy against th...

متن کامل

Misère quotients for impartial games

We announce misère-play solutions to several previously-unsolved combinatorial games. The solutions are described in terms of misère quotients—commutative monoids that encode the additive structure of specific misère-play games. We also introduce several advances in the structure theory of misère quotients, including a connection between the combinatorial structure of normal and misère play.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: BMGN - Low Countries Historical Review

سال: 2017

ISSN: 2211-2898,0165-0505

DOI: 10.18352/bmgn-lchr.10218